A verifiable ranked ciphertext retrieval scheme based on bilinear mapping
نویسندگان
چکیده
منابع مشابه
Outsource the Ciphertext Decryption of Inner Product Predicate Encryption Scheme Based on Prime Order Bilinear Map
In the private index predicate encryption scheme, the ciphertext not only hides the message, but also hides the attributes. Predicate encryption scheme can enforce the fine grained access control over the encrypted data and perform selective search on the encrypted data. However, the main efficiency drawback of predicate encryption scheme is that the size of the ciphertext and the time required...
متن کاملDynamic and verifiable multi-secret sharing scheme based on Hermite interpolation and bilinear maps
(t, n) threshold secret sharing is a cryptographic mechanism to divide and disseminate information among n participants in a way that at least t(t ≤ n) of them should be present for the original data to be retrieved. This has practical applications in the protection of secure information against loss, destruction and theft. In this study, the authors propose a new multi-secret sharing scheme wh...
متن کاملNovel verifiable multi-secret sharing scheme using bilinear pairing
Secret sharing schemes as basic building blocks for many applications in distributed systems should be efficient and robust to any possible attacks. Based on bilinear pairing, this paper will propose a new (t, n) threshold verifiable multi-secret sharing scheme and a GGOC verifiable multi-secret sharing scheme that improve the security and minimizes the number of published values.
متن کاملUsing Ciphertext Policy Attribute Based Encryption for Verifiable Secret Sharing
Threshold secret sharing schemes are used to divide a given secret by a dealer in parts such that no less than the threshold number of shareholders can reconstruct the secret. However, these schemes are susceptible to the malicious behavior of a shareholder or a dealer. To prevent such attacks, it is necessary to make a provision for verification of the integrity of the shares distributed by th...
متن کاملPublic Verifiable Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings
This paper presents public verifiable identity based multi-proxy multisigncryption scheme from pairings. In this scheme a proxy signcrypter group could authorized as a proxy agent by the cooperation of all members in the original signcrypter group. Then the proxy signcryption can be generated by the cooperation of all the signcrypters in the authorized proxy signcrypter group on the behalf of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concurrency and Computation: Practice and Experience
سال: 2020
ISSN: 1532-0626,1532-0634
DOI: 10.1002/cpe.5829